Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
201	Approximation Quality of the Hypervolume Indicator Karl Bringmanna , Tobias Friedrichb a Max-Planck-Institut f¨ ur Informatik, Saarbr¨ Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:48:16 Computational complexity theory Approximation algorithm Multi-objective optimization Multiplicative inverse Optimization problem Asymptotic analysis
202	Computational Complexity of Evolutionary Computation in Combinatorial Optimisation Frank Neumann1 Carsten Witt2 Add to Reading List Source URL: ls11-www.cs.uni-dortmund.de Language: English - Date: 2008-09-30 04:35:29 Theoretical computer science Operations research Computational complexity theory Cybernetics Evolution Mathematical optimization Evolutionary algorithm Algorithm Heuristic Combinatorics Combinatorial optimization Local search
203	Efficient Secure Computation Optimization Raphael Urmoneit Florian Kerschbaum Technische Universität Add to Reading List Source URL: www.fkerschbaum.org Language: English - Date: 2013-08-28 05:10:42 Complexity classes Theoretical computer science Computational resources Mathematical logic Computability theory Algorithm Recursion NP DSPACE FO Exponential time hypothesis Time complexity
204	Tight Bounds for the Approximation Ratio of the Hypervolume Indicator Karl Bringmann1 and Tobias Friedrich2 1 2 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:45:12 Mathematical optimization Computational complexity theory Multi-objective optimization Approximation algorithm Approximation theory Pareto efficiency Valuation
205	Reuse It Or Lose It: More Efficient Secure Computation Through Reuse of Encrypted Values Benjamin Mood Yale University Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2014-08-25 10:31:08 Circuit complexity Complexity classes Secure multi-party computation Computational complexity theory Digital circuits Circuit Boolean circuit CC Hash function NC
206	Introduction & Motivation Relations and Operations The complexity of positive equality-free first-order logic II: the four-element case Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2010-08-24 16:58:08 Complexity classes Finite model theory Computational complexity theory Descriptive complexity Structural complexity theory FO SO P versus NP problem NP P Reduction HO
207	Additively efficient universal computers Daniel Dewey∗ Oxford Martin Programme on the Impacts of Future Technology, Future of Humanity Institute Add to Reading List Source URL: www.danieldewey.net Language: English - Date: 2014-04-04 07:59:10 Turing machine Computability theory Theory of computation Models of computation Alan Turing Universal Turing machine Turing completeness Kolmogorov complexity Computational complexity theory ChurchTuring thesis Cellular automaton Computer
208	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Counting Triangulations Approximately Victor Alvarez∗ Karl Bringmann† Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:45:44 Triangulation Analysis of algorithms Computational complexity theory Time complexity Big O notation NC Matching Algorithm Minimum-weight triangulation Planar separator theorem
209	CS369E: Communication Complexity (for Algorithm Designers) Lecture #7: Lower Bounds in Algorithmic Game Theory∗ Tim Roughgarden† March 5, 2015 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-09-14 17:18:05 Game theory Computational complexity theory Quantum complexity theory Complexity classes Decision theory Nash equilibrium Price of anarchy Exponential time hypothesis Circuit complexity Communication complexity Algorithmic game theory PP
210	Modeling Real-World Data Sets Susanne Albers Department of Computer Science, Technische Universität München Boltzmannstr. 3, 85748 Garching, Germany Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2015-06-11 03:07:17 Analysis of algorithms Computational complexity theory Susanne Albers Software optimization Cache Dagstuhl Best worst and average case Algorithm Analysis Locality of reference Computational geometry Paging